Exact Upper Bounds and Their Uses in Settheorymenachem
نویسنده
چکیده
The existence of exact upper bounds for increasing sequences of ordinal functions modulo an ideal is discussed. The main theorem (Theorem 18 below) gives a necessary and suucient condition for the existence of an exact upper bound f for a < I-increasing sequence f = hf : < i On A where > jAj + is regular: an eub f with lim inf I cff(a) = exists if and only if for every regular 2 (jAj;) the set of at points in f of coonality is stationary. Two applications of the main Theorem to set theory are presented. A theorem of Magidor's on covering between models of ZFC is proved using the main theorem (Theorem 22): If V W are transitive models of set theory with !-covering and GCH holds in V , then-covering holds between V and W for all cardinals. A new proof of a Theorem by Cummings on collapsing successors of singulars is also given (Theorem 24). The appendix to the paper contains a short proof of Shelah's trichotomy theorem, for the reader's convenience. 1. Introduction Shelah's work on Cardinal Arithmetic (see 7], 1] and 4]) introduced the theory of possible true coonalities of products of sets of regular cardinals modulo an ideal | pcf theory. The relevance of pcf theory to set theory and other branches of mathematics was demonstrated by a series of applications. In this paper the dual problem is addressed: suppose a set of ordinal
منابع مشابه
Exact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملA Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
In this paper, a branch and bound algorithm for computing the treewidth of a graph is presented. The method incorporates extensions of existing results, and uses new pruning and reduction rules, based upon properties of the adopted branching strategy. We discuss how the algorithm can not only be used to obtain exact bounds for the treewidth, but also to obtain upper and/or lower bounds. Computa...
متن کاملOn Moments of the Concomitants of Classic Record Values and Nonparametric Upper Bounds for the Mean under the Farlie-Gumbel-Morgenstern Model
In a sequence of random variables, record values are observations that exceed or fall below the current extreme value.Now consider a sequence of pairwise random variables {(Xi,Yi), i>=1}, when the experimenter is interested in studying just thesequence of records of the first component, the second component associated with a record value of the first one is termed the concomitant of that ...
متن کاملSpectral Bisection Algorithm for Solving Schrödinger Equation Using Upper and Lower Solutions
This paper establishes a new criteria for obtaining a sequence of upper and lower bounds for the ground state eigenvalue of Schrödinger equation −∆ψ(r)+V (r)ψ(r) = Eψ(r) in N spatial dimensions. Based on this proposed criteria, we prove a new comparison theorem in quantum mechanics for the ground state eigenfunctions of Schrödinger equation. We determine also lower and upper solutions for the e...
متن کامل